Arithmetic + Logic + Geometry = Concurrency

نویسنده

  • Vaughan R. Pratt
چکیده

0 Introduction In deening concurrency one dichotomy that has arisen is between reductionism and primitivism. The reductionist viewpoint reduces concurrent behavior to nondeterministic sequential behavior by viewing it as interleaving. The primitive school treats concurrent behavior as a basic form of behavior in its own right, distinct from and indeed more general than sequential behavior. A basic argument for reductionism is that nonsequential behavior is best understood in terms of sequential behavior because the latter is the kind we understand naturally and instinctively, or at least the kind with which we have by far the most experience. At the conscious level each of us appears to be a sequential agent. Our limbs, muscles, and cells may act concurrently, but our control of them is basically sequential and the necessary concurrent control seems to happen below the level of our conscious control, or it would be just as easy to twiddle our thumbs in opposite directions as in the same direction. Primitivists object that reducing concurrent behavior to sequential makes the former harder rather than easier to understand. By analogy, organizing a TV image as the sequence of its scan lines in one dimension, the form in which it arrives at your receiver, makes it much harder to see. It is not so much a question of whether information is lost as the complexity of piecing the information back together. Even if reductionism is the only mode of thought presently available for the perception of concurrent behavior, it is such a poor way of thinking about it that we are better oo learning to deal with concurrency in its own right than persisting with reductionism. Reductionists counter that primitivism is not fully abstract, that is, draws unobservable distinctions. In the context of dataaow nets Kok Kok87], Jonsson Jon89], Rabinovich and Trakhtenbrot RT88], Russell Rus89], and others have shown that reductionism, unlike primitivism, is fully abstract.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axiomatizations of Interval Logics

Interval logic has been introduced as a temporal logic that provides higher-level constructs and an intuitive graphical representation, making it easier in interval logic than in other temporal logics to specify and reason about concurrency in software and hardware designs. In this paper we present axiomatizations for two propositional interval logics and relate these logics to Until Temporal L...

متن کامل

Design and Simulation of a 2GHz, 64×64 bit Arithmetic Logic Unit in 130nm CMOS Technology

The purpose of this paper is to design a 64×64 bit low power, low delay and high speed Arithmetic Logic Unit (ALU). Arithmetic Logic Unit performs arithmetic operation like addition, multiplication. Adders play important role in ALU. For designing adder, the combination of carry lookahead adder and carry select adder, also add-one circuit have been used to achieve high speed and low area. In mu...

متن کامل

Status of the Bound-T WCET Tool

Bound-T is a tool for static WCET analysis from binary executable code. We describe the general structure of the tool and some specific difficulties met in the analysis of the supported processors, which are the Intel 8051 8-bit microcontrollers, the Analog Devices ADSP21020 Digital Signal Processor, and the SPARC V7 processor. For the DSP, the problem is the complex program sequencing logic us...

متن کامل

Model Checking in CLP

We show that Constraint Logic Programming CLP can serve as a conceptual basis and as a practical implementation platform for the model checking of in nite state systems Our contributions are a semantics preserving translation of concurrent systems into CLP programs a method for verifying safety and liveness properties on the CLP programs produced by the translation We have implemented the metho...

متن کامل

Second Year Progress Report Language Interoperability and Logic Programming Languages

The LLP/Prolog to Java translator Prolog Café was altered to produce C# instead. New built-in predicates were added to enable the user to exploit the concurrency support in C# from the Prolog side. I now intend to work on optimising the translated code by detecting common programming idioms and by allowing the programmer to add mode annotations to their code. I also intend to add a module syste...

متن کامل

Towards Automated Proof Support for Probabilistic Distributed Systems

The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience indicates [12, 4, 11] that there are many difficulties in automating real-number arithmetic in the context of other program features. In this paper we propose a framework for verification of probabilistic distributed systems bas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992